[WIP] A game of surface codes demo #1355
Conversation
|
👋 Hey, looks like you've updated some demos! 🐘 Don't forget to update the Please hide this comment once the field(s) are updated. Thanks! |
|
Thank you for opening this pull request. You can find the built site at this link. Deployment Info:
Note: It may take several minutes for updates to this pull request to be reflected on the deployed site. |
| r"""A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery | ||
| =============================================================================== | ||
|
|
||
| abstract |
There was a problem hiding this comment.
Is there an abstract to be added?
There was a problem hiding this comment.
Yes and a "hero image" :)
| However, it still helps to understand the correspondences in physical fault tolerant quantum computing (FTQC) architectures. | ||
| First of all it is important to note that we consider surface codes that implement `(Clifford + T) <https://pennylane.ai/compilation/clifford-t-gate-set>`__ circuits. | ||
| In particular, these circuits can be compiled to circuits that just perform `Pauli product measurements <https://pennylane.ai/compilation/pauli-product-measurement>`__. | ||
| This is because all Clifford operations can be moved to the end of the circuit and merged with measurements. |
There was a problem hiding this comment.
Not sure if it is too much detail at this point, but Clifford operations can also be implemented via measurements.
Co-authored-by: David Ittah <[email protected]>
P0 Game of Surface Codes Demo 2025 Q2 [sc-87600]
open question:
do I understand it correct that single X and Z measurements are free, but joint measurements cost 1 🕒?>> yesWhat does it mean that the error probability of the distillation of 15 faulty magic states with$p$ leads to a faulty magic state with probability $35p^3$ , yet, the probability of failure is $(1-p)^n$ ? 🤔>> p is the infidelity of the state, and